An approximation algorithm for the hamiltonian walk problem on maximal planar graphs
نویسندگان
چکیده
منابع مشابه
An approximation algorithm for the hamiltonian walk problem on maximal planar graphs
A hamiltonian walk of a graph is a shortest closed walk that passes through every vertex at least once, and the length is the total number of traversed edges. The hamiltonian walk problem in which one would like to find a hamiltonian walk of a given graph is NP-complete. The problem is a generalized hamiltonian cycle problem and is a special case of the traveling salesman problem. Employing the...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAn update on non-Hamiltonian 54-tough maximal planar graphs
Studying the shortness of longest cycles in maximal planar graphs, we improve the upper bound on the shortness exponent of the class of 54 -tough maximal planar graphs presented by Harant and Owens [Discrete Math. 147 (1995), 301–305]. In addition, we present two generalizations of a similar result of Tkáč who considered 1-tough maximal planar graphs [Discrete Math. 154 (1996), 321–328]; we rem...
متن کاملAn Approximation Algorithm for the Bandwidth Problem on Dense Graphs
The bandwidth problem is the problem of numbering the vertices of a given graph G such that the maximum di erence between two numbers of adjacent vertices is minimal The problem is known to be NP complete Pa and there are only few algorithms for rather special cases of the problem HMM Kr Sa Sm In this paper we present a randomized approximation algorithm for the bandwidth problem restricted to ...
متن کاملA linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs
The Hamiltonian cycle problem is one of the most popular NP-complete problems, and remains NP-complete even if we restrict ourselves to a class of (3-connected cubic) planar graphs [5,9]. Therefore, there seems to be no polynomial-time algorithm for the Hamiltonian cycle problem. However, for certain (nontrivial) classes of restricted graphs, there exist polynomial-time algorithms [3,4,6]. In f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1983
ISSN: 0166-218X
DOI: 10.1016/0166-218x(83)90042-2